Overcoming individual process model matcher weaknesses using ensemble matching

نویسندگان

  • Christian Meilicke
  • Henrik Leopold
  • Elena Kuss
  • Heiner Stuckenschmidt
  • Hajo A. Reijers
چکیده

In recent years, a considerable number of process model matching techniques have been proposed. The goal of these techniques is to identify correspondences between the activities of two process models. However, the results from the Process Model Matching Contest 2015 reveal that there is still no universally applicable matching technique and that each technique has particular strengths and weaknesses. It is hard or even impossible to choose the best technique for a given matching problem. We propose to cope with this problem by running an ensemble of matching techniques and automatically selecting a subset of the generated correspondences. To this end, we propose a Markov Logic based optimization approach that automatically selects the best correspondences. The approach builds on an adaption of a voting technique from the domain of schema matching and combines it with process model specific constraints. Our experiments show that our approach is capable of generating results that are significantly better than alternative approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Classification to Matching Patterns for Process Model Matching Evaluation

Business process model matching is concerned with the detection of similarities in business process models. To support the progress of process model matching techniques, efficient evaluation strategies are required. State-of-the-art evaluation techniques provide a grading of the evaluated matching techniques. However, they only offer limited information about strength and weaknesses of the indi...

متن کامل

Improving Ontology Matching Using Meta-level Learning

Despite serious research efforts, automatic ontology matching still suffers from severe problems with respect to the quality of matching results. Existing matching systems trade-off precision and recall and have their specific strengths and weaknesses. This leads to problems when the right matcher for a given task has to be selected. In this paper, we present a method for improving matching res...

متن کامل

Boosting Schema Matchers

Schema matching is recognized to be one of the basic operations required by the process of data and schema integration, and thus has a great impact on its outcome. We propose a new approach to combining matchers into ensembles, called Schema Matcher Boosting (SMB). This approach is based on a well-known machine learning technique, called boosting. We present a boosting algorithm for schema matc...

متن کامل

Managing Uncertainty in Schema Matcher Ensembles

Schema matching is the task of matching between concepts describing the meaning of data in various heterogeneous, distributed data sources. With many heuristics to choose from, several tools have enabled the use of schema matcher ensembles, combining principles by which different schema matchers judge the similarity between concepts. In this work, we investigate means of estimating the uncertai...

متن کامل

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Decision Support Systems

دوره 100  شماره 

صفحات  -

تاریخ انتشار 2017